Coordinated Placement and Replacement for Grid-Based Hierarchical Web Caches

نویسندگان

  • Wenzhong Li
  • Kun Wu
  • Xu Ping
  • Ye Tao
  • Sanglu Lu
  • Daoxu Chen
چکیده

Web caching has been well accepted as a viable method for saving network bandwidth and reducing user access latency. To provide cache sharing on a large scale, hierarchical web caching has been widely deployed to improve the scalability of content dissemination through the World Wide Web. In this paper, we present GHC, a grid-based hierarchical web caching architecture, for constructing efficient cache hierarchy in Grid environment. Basing on the GHC architecture, we also proposed HCPR algorithm, which is a novel coordinated placement and replacement algorithm for hierarchical web caching scheme. The principle of HCPR algorithm is to improve cache usage, to cache hot document close to clients so as to minimize the number of hops to locate and access Web documents. The simulation study shows that the HCPR algorithm has higher cache hit ratio and lower access latency compared with the traditional hierarchical caching algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coordinated Placement and Replacement for Large-Scale Distributed Caches

In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their eeectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperativ...

متن کامل

Cache Placement Methods Based on Client Demand Clustering

One of the principal motivations for content delivery networks, such as those that have been deployed over the past three years, is to improve performance from the perspective of the client. Ideally, this is achieved by placing caches close to groups of clients and then routing client requests to the nearest cache. In the first part of this paper we present a new method for identifying regions ...

متن کامل

Improving Data Grids Performance by Using Modified Dynamic Hierarchical Replication Strategy

Abstract: A Data Grid connects a collection of geographically distributed computational and storage resources that enables users to share data and other resources. Data replication, a technique much discussed by Data Grid researchers in recent years creates multiple copies of file and places them in various locations to shorten file access times. In this paper, a dynamic data replication strate...

متن کامل

CRRP: Cost-Based Replacement with Random Placement for En-Route Caching

Caching is considered widely as an efficient way to reduce access latency and network bandwidth consumption. En-route caching, where caches are associated with routing nodes in the network, is proposed in the context of Web cache to exploit fully the potential of caching. To make sensible replacement and placement decision for en-route caching, traditional caching schemes either engage computat...

متن کامل

Exploiting Client Caches: An Approach to Building Large Web Caches

New demands brought by the continuing growth of the Internet will be met in part by more effective and comprehensive use of caching. This paper proposes to exploit client browser caches in cooperative proxy caching by constructing the client caches within each organization (e.g., corporate networks) as a large peer-to-peer client cache. Via trace-driven simulations we evaluate the potential per...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005